package com.symphony.crypto;

public class RSA {
	
	private void algorithm() {
		//first step
		int p = NumbersUtil.generateRandomPrime(); 
		int q = NumbersUtil.generateRandomPrime();
		//second step
		int n = p * q;
		//third step
		int fi = NumbersUtil.fi(p, q);
		int e = NumbersUtil.generateRandomRelativelyPrime(fi);
		
	}
	
	public static void main(String[] args) {
		System.out.println(NumbersUtil.gcd(120, 23));
	}
}
